Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing
نویسندگان
چکیده
Integer Programming and High-Throughput Computing Jeff Linderoth Department of Industrial and Systems Engineering, The University of Wisconsin-Madison, 1513 University Ave., 3226 Mechanical Engineering Building, Madison, WI 53706, USA, [email protected] François Margot Tepper School of Business, Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA 15213-3890, USA, [email protected] Greg Thain Department of Computer Science, The University of Wisconsin-Madison, 1210 W. Dayton St., Madison, WI 53706, USA, [email protected]
منابع مشابه
Improving Bounds on the Football Pool Problem via Symmetry Reduction and High-Throughput Computing
Symmetry Reduction and High-Throughput Computing Jeff Linderoth Department of Industrial and Systems Engineering, The University of Wisconsin-Madison, 3226 Mechanical Engineering Building, 1513 University Ave., Madison, WI 53706, USA, [email protected] François Margot Tepper School of Business, Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA 15213-3890, USA, [email protected]...
متن کاملA bi-level linear programming problem for computing the nadir point in MOLP
Computing the exact ideal and nadir criterion values is a very important subject in multi-objective linear programming (MOLP) problems. In fact, these values define the ideal and nadir points as lower and upper bounds on the nondominated points. Whereas determining the ideal point is an easy work, because it is equivalent to optimize a convex function (linear function) over a con...
متن کاملIntegrated Due Date Setting and Scheduling on a Single Machine Considering an Unexpected Unavailability
In this paper, an integrated machine scheduling withits due date setting problem has been considered. It is assumed that the machine is subject to some kind of random unavailability. Due dates should be set in an attractive and reliable manner, implying that they should be short and possible to be met. To this end, first, long due dates are penalized in the objective function. Then, for each cu...
متن کاملیافتن راه‌حل‌های مؤثر در مسائل بهینه‌سازی ترکیبی چندهدفه به کمک روش قیود ارتجاعی
In this paper, a general process is developed to find all non-dominated solutions of the multi objective combinatorial optimization (MOCO) problem. This process is based on the elastic constraints method and applies the identification of objective's bounds for it. Objectives bounds are determined by solving single objective integer programming problems. First the elastic constraints method is...
متن کاملA Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers
The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- INFORMS Journal on Computing
دوره 21 شماره
صفحات -
تاریخ انتشار 2009